Search results for "Completion time"
showing 6 items of 6 documents
Limitations of the trail making test part-B in assessing frontal executive dysfunction.
2015
AbstractPart B of the Trail Making Test (TMT-B) is one of the most widely used neuropsychological tests of “executive” function. A commonly held assumption is that the TMT-B can be used to detect frontal executive dysfunction. However, so far, research evidence has been limited and somewhat inconclusive. In this retrospective study, performance on the TMT-B of 55 patients with known focal frontal lesions, 27 patients with focal non-frontal lesions and 70 healthy controls was compared. Completion time and the number of errors made were examined. Patients with frontal and non-frontal lesions performed significantly worse than healthy controls for both completion time and the number of errors.…
Patient reported feasibility and acceptance of Montreal Cognitive Assessment (MoCA) screening pre- and postoperatively in brain tumour patients.
2018
Abstract Background Montreal Cognitive Assessment (MoCA) represents a short screening tool for neuropsychological deficits. The study’s aim was to test feasibility and acceptance of MoCA in patients with brain tumours perioperatively. Methods Patients with supratentorial located brain tumours were assessed preoperatively (t1, day −1) and postoperatively (t2, day 3–5) using EORTC-QLQ-C30 + BN20, Distress Thermometer (DT) and the MoCA test (different versions). Feasibility was evaluated by a feedback form and patients were asked about perceived discomfort, overstraining or complexity of MoCA. Results of MoCA were correlated with clinical factors. Results 63 patients participated, 19 were male…
Stochastic Scheduling of Production Orders Under Uncertainty
2017
This paper attempts to solve the problem of searching minimum production order completion time variants by means of stochastic logical structures with all cost curve descent points and corresponding minimum-cost schedules. The analysis presented in this paper considers scheduling of unique and small batch production, predominantly to order, which accounts for changing requirements of the customer, the complexity and long production process makespan including its technical preparation. Scheduling of production order was performed by means of GAN networks and employed the concept of soft relations. The cost/time relation analysis is based on two-node network models using the cost curve. A new…
Scheduling shared continuous resources on many-cores
2014
We consider the problem of scheduling a number of jobs on m identical processors sharing a continuously divisible resource. Each job j comes with a resource requirement rj∈[0,1]. The job can be processed at full speed if granted its full resource requirement. If receiving only an x-portion of r_j, it is processed at an x-fraction of the full speed. Our goal is to find a resource assignment that minimizes the makespan (i.e., the latest completion time). Variants of such problems, relating the resource assignment of jobs to their processing speeds, have been studied under the term discrete-continuous scheduling. Known results are either very pessimistic or heuristic in nature. In this paper, …
Project During Execution – Strategy – Updating
2014
This chapter fundamentally examines project performance during its execution period, however, risk must always be considered, especially at the very beginning of the project when the risk is normally maximum, and at each update. In the Project Monitoring stage, this chapter explores what happens with foreseen risks, that is, if they really happened or not and their consequences. In the Project Control stage, the chapter uses Earned Value Analysis and examines Performance Factors, which are used to predict completion regarding time and cost. However, because these calculations are based on past performance, there is always the risk that this performance will not be replicated in the future, …
Branch-and-Price-and-Cut for the Active-Passive Vehicle-Routing Problem
2018
This paper presents a branch-and-price-and-cut algorithm for the exact solution of the active-passive vehicle-routing problem (APVRP). The APVRP covers a range of logistics applications where pickup-and-delivery requests necessitate a joint operation of active vehicles (e.g., trucks) and passive vehicles (e.g., loading devices such as containers or swap bodies). The objective is to minimize a weighted sum of the total distance traveled, the total completion time of the routes, and the number of unserved requests. To this end, the problem supports a flexible coupling and decoupling of active and passive vehicles at customer locations. Accordingly, the operations of the vehicles have to be s…